Complete axiomatizations for XPath fragments
نویسندگان
چکیده
منابع مشابه
Complete axiomatizations for XPath fragments
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downward single axis fragments of Core XPath (that is, Core XPath(↓) and Core XPath(↓)) as well as the full Core XPath. We make use of techniques from modal logic. XPath is a language for navigating through XML documents. In ...
متن کاملAxiomatizations for downward XPath on Data Trees
We give sound and complete axiomatizations for XPath with data tests by ‘equality’ or ‘inequality’, and containing the single ‘child’ axis. This data-aware logic predicts over data trees, which are tree-like structures whose every node contains a label from a finite alphabet and a data value from an infinite domain. The language allows us to compare data values of two nodes but cannot access th...
متن کاملContainment and Integrity Constraints for XPath Fragments
XPath is a W3C standard that plays a crucial role in several in uential query, transformation, and schema standards for XML. Motivated by the larger challenge of XML query optimization, we investigate the problem of containment of XPath expressions under integrity constraints that are in turn formulated with the help of XPath expressions. Our core formalism consists of a fragment of XPath that ...
متن کاملContainment for XPath Fragments under DTD Constraints
The containment and equivalence problems for various fragments of XPath have been studied by a number of authors. For some fragments , deciding containment (and even minimisation) has been shown to be in ptime, while for minor extensions containment has been shown to be conp-complete. When containment is with respect to trees satisfying a set of constraints (such as a schema or DTD), the proble...
متن کاملStructural Properties of XPath Fragments
We study structural properties of each of the mainsublanguages of XPath [8] commonly used in practice.First, we characterize the expressive power of these lan-guage fragments in terms of both logics and tree pat-terns. Second, we investigate closure properties, fo-cusing on the ability to perform basic Boolean oper-ations while remaining within the fragment. We give a<lb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2010
ISSN: 1570-8683
DOI: 10.1016/j.jal.2009.09.002